Goto

Collaborating Authors

 Travel


Six out of 10 in Japan using generative AI to plan summer trips, survey finds

The Japan Times

More people are using generative artificial intelligence to make travel plans for their summer vacation and letting their children use the technology when doing their homework during summer holidays. Six out of 10 people who responded to a survey on this year's summer holidays said they are using generative artificial intelligence to make travel plans. The survey, conducted by Meiji Yasuda Life Insurance on 1,120 people in their 20s to 50s in June, showed that 61.2% of those planning to travel in Japan or abroad refer to generative AI to make travel itineraries, as well as obtain information on local food and transportation. "The main tool people use for planning trips and doing research when they get there is shifting from travel guidebooks to generative AI," the firm said. Asked how they plan to spend their summer holidays, 58.4% said they are going out, down by 6.3 percentage points from last year. The rate of those traveling in Japan was 57.6%, up by 1 percentage point, while the ratio of those traveling overseas halved from 13.5% last year to 6.4%.


Man overboard! AI 'guardian' for cruise ships can detect passengers falling into the water instantly - even in darkness

Daily Mail - Science & tech

University of Alabama student found dead alongside her friend and the dog he was pet sitting after animal's owner saw suspicious activity on her doorbell camera Trump says Iran wants to make a deal'so badly' after unleashing 90 fresh airstrikes as Tehran retaliates across the Gulf Justin Baldoni and wife Emily break two-year silence to slam Blake Lively and accuse her of causing them'pain' with'untruthful' claims: 'There is so much more to say' Deadly bacteria found in major US city's wastewater system tied to Mark Zuckerberg's $800m data center Prince Harry and me: A small white pill, 'naughtiness' and why I wish I could erase our friendship from my memory. Spectacular downfall of'America's best doctor': Life of private planes and luxury cars comes crashing down after shocking double life is exposed Tragic details of Storage Wars star Darrell Sheets' handwritten suicide note revealed... two months after his death at 67 Margaret Qualley and Jack Antonoff's fight that ruined their ...


Statistical and Structural Approaches to Algorithmic Fairness

arXiv.org Machine Learning

Modern machine learning systems have outgrown their origins as isolated predictive constructs, evolving into complex socio-technical architectures that actively mediate human opportunity. As algorithms increasingly determine access to economic and social opportunities, it has become widely recognized that these systems are deeply embedded with the structural inequalities and prejudices of their environments. The field of algorithmic fairness emerged in response to the growing recognition that models optimized for predictive accuracy can systematically disadvantage marginalized groups. Early mitigation strategies, however, rested on fragile simplifications that limited their effectiveness in complex sociotechnical environments. This thesis identifies and addresses two fundamental limitations of contemporary fairness paradigms: the reliance on deterministic point estimates for auditing and the treatment of individuals as isolated entities devoid of structural context. First, the diagnosis of algorithmic unfairness has traditionally depended on scalar metrics that fail to capture the nuances of real-world deployment. This deterministic approach ignores the high statistical variance inherent in small, intersectional groups, often leading to false alarms or missed detections of bias. Furthermore, standard auditing struggles with the opacity of black-box models, frequently conflating unjustifiable bias with the influence of legitimate features.


Hierarchical Optimization via LLM-Guided Objective Evolution for Mobility-on-Demand Systems

Neural Information Processing Systems

Online ride-hailing platforms aim to deliver efficient mobility-on-demand services, often facing challenges in balancing dynamic and spatially heterogeneous supply and demand. Existing methods typically fall into two categories: reinforcement learning (RL) approaches, which suffer from data inefficiency, oversimplified modeling of real-world dynamics, and difficulty enforcing operational constraints; or decomposed online optimization methods, which rely on manually designed highlevel objectives that lack awareness of low-level routing dynamics. To address this issue, we propose a novel hybrid framework that integrates large language model (LLM) with mathematical optimization in a dynamic hierarchical system: (1) it is training-free, removing the need for large-scale interaction data as in RL, and (2) it leverages LLM to bridge cognitive limitations caused by problem decomposition by adaptively generating high-level objectives. Within this framework, LLM serves as a meta-optimizer, producing semantic heuristics that guide a low-level optimizer responsible for constraint enforcement and real-time decision execution. These heuristics are refined through a closed-loop evolutionary process, driven by harmony search, which iteratively adapts the LLM prompts based on feasibility and performance feedback from the optimization layer. Extensive experiments based on scenarios derived from both the New York and Chicago taxi datasets demonstrate the effectiveness of our approach, achieving an average improvement of 16% compared to state-of-the-art baselines.


OptiTree: Hierarchical Thoughts Generation with Tree Search for LLMOptimization Modeling

Neural Information Processing Systems

Optimization modeling is one of the most crucial but technical parts of operations research (OR). To automate the modeling process, existing works have leveraged large language models (LLMs), prompting them to break down tasks into steps for generating variables, constraints, and objectives. However, due to the highly complex mathematical structures inherent in OR problems, standard fixed-step decomposition often fails to achieve high performance. To address this challenge, we introduce OptiTree, a novel tree search approach designed to enhance modeling capabilities for complex problems through adaptive problem decomposition into simpler subproblems. Specifically, we develop a modeling tree that organizes a wide range of OR problems based on their hierarchical problem taxonomy and complexity, with each node representing a problem category and containing relevant high-level modeling thoughts. Given a problem to model, we recurrently search the tree to identify a series of simpler subproblems and synthesize the global modeling thoughts by adaptively integrating the hierarchical thoughts. Experiments show that OptiTree significantly improves the modeling accuracy compared to the state-of-theart, achieving over 10% improvements on the challenging benchmarks.


TransferTraj: AVehicle Trajectory Learning Model for Region and Task Transferability

Neural Information Processing Systems

Vehicle GPS trajectories provide valuable movement information that supports various downstream tasks and applications. A desirable trajectory learning model should be able to transfer across regions and tasks without retraining, avoiding the need to maintain multiple specialized models and subpar performance with limited training data. However, each region has its unique spatial features and contexts, which are reflected in vehicle movement patterns and are difficult to generalize. Additionally, transferring across different tasks faces technical challenges due to the varying input-output structures required for each task. Existing efforts towards transferability primarily involve learning embedding vectors for trajectories, which perform poorly in region transfer and require retraining of prediction modules for task transfer. To address these challenges, we propose TransferTraj, a vehicle GPS trajectory learning model that excels in both region and task transferability.



Wide-Horizon Thinking and Simulation-Based Evaluation for Real-World LLMPlanning with Multifaceted Constraints

Neural Information Processing Systems

Unlike reasoning, which often entails a deep sequence of deductive steps, complex real-world planning is characterized by the need to synthesize a broad spectrum of parallel and potentially conflicting information and constraints. For example, in travel planning scenarios, it requires the integration of diverse real-world information and user preferences.


URB - Urban Routing Benchmark for RL-equipped Connected Autonomous Vehicles

Neural Information Processing Systems

Connected Autonomous Vehicles (CAVs) promise to reduce congestion in future urban networks, potentially by optimizing their routing decisions. Unlike for human drivers, these decisions can be made with collective, data-driven policies, developed using machine learning algorithms. Reinforcement learning (RL) can facilitate the development of such collective routing strategies, yet standardized and realistic benchmarks are missing.


Cross City Traffic Flow Generation via Retrieval Augmented Diffusion Model

Neural Information Processing Systems

Traffic flow data are of great value in smart city applications. However, limited by data collection costs and privacy sensitivity, it is rather difficult to obtain large-scale traffic flow data. Therefore, various data generation methods have been proposed in the literature. Nevertheless, these methods often require data from a specific city for training and are difficult to directly apply to new cities lacking data. To address this problem, this paper proposes a retrieval-augmented diffusion generation model with geographic representation alignment. We use data from multiple source cities for training, extract consistent representations across multiple cities, and leverage retrieval-augmented generation (RAG) technology to incorporate dynamic traffic flow patterns into the condition, aiming to improve the accuracy of data generation in the target city. Experiments on four real-world datasets demonstrate that, compared to existing generation methods, our method achieves best cross-city zero-shot performance.